class Solution:
def maxAreaOfIsland(self, grid: List[List[int]]) -> int:
def trav(i, j):
if i >= len(grid):
return 0
elif j >= len(grid[i]):
return 0
if i < 0:
return 0
if j < 0:
return 0
if grid[i][j] == 1:
grid[i][j] = 0
ans = trav(i-1, j) + trav(i+1, j) + trav(i, j-1) + trav(i, j+1) + 1
return ans
return 0
ans = 0
for i in range(len(grid)):
for j in range(len(grid[i])):
if grid[i][j] == 1:
ans = max(ans, trav(i, j))
return ans
1621A - Stable Arrangement of Rooks | 472A - Design Tutorial Learn from Math |
1368A - C+= | 450A - Jzzhu and Children |
546A - Soldier and Bananas | 32B - Borze |
1651B - Prove Him Wrong | 381A - Sereja and Dima |
41A - Translation | 1559A - Mocha and Math |
832A - Sasha and Sticks | 292B - Network Topology |
1339A - Filling Diamonds | 910A - The Way to Home |
617A - Elephant | 48A - Rock-paper-scissors |
294A - Shaass and Oskols | 1213A - Chips Moving |
490A - Team Olympiad | 233A - Perfect Permutation |
1360A - Minimal Square | 467A - George and Accommodation |
893C - Rumor | 227B - Effective Approach |
1534B - Histogram Ugliness | 1611B - Team Composition Programmers and Mathematicians |
110A - Nearly Lucky Number | 1220B - Multiplication Table |
1644A - Doors and Keys | 1644B - Anti-Fibonacci Permutation |